Using Hook Schur Functions to Compute Matrix Cocharacters
نویسندگان
چکیده
منابع مشابه
Quasisymmetric (k, l)-hook Schur functions
We introduce a quasisymmetric generalization of Berele and Regev’s hook Schur functions and prove that these new quasisymmetric hook Schur functions decompose the hook Schur functions in a natural way. In this paper we examine the combinatorics of the quasisymmetric hook Schur functions, providing analogues of the RobinsonSchensted-Knuth algorithm and a generalized Cauchy Identity. Résumé. Nous...
متن کاملInfinite-dimensional Lie Superalgebras and Hook Schur Functions
Making use of a Howe duality involving the infinite-dimensional Lie superalgebra ĝl∞|∞ and the finite-dimensional group GLl of [CW3] we derive a character formula for a certain class of irreducible quasi-finite representations of ĝl∞|∞ in terms of hook Schur functions. We use the reduction procedure of ĝl∞|∞ to ĝln|n to derive a character formula for a certain class of level 1 highest weight ir...
متن کاملUsing Generating Functions to Compute Concurrency
We present succinctly the Arnold-Nivat's model for the synchronization of sequential preocesses, and we recall the concurrency measure defined by Beauquier, Dérard and Thimonier. We present here a new technics for the computation of this measure avoiding very often a very expensive part of the computation. We illustrate this method by the mutual exclusion example.
متن کاملUsing the Matrix Method to Compute the Degrees of Freedom of Mechanisms
In this paper, some definitions and traditional formulas for calculating the mobility of mechanisms are represented, e.g. Grubler formula, Somov - Malyshev formula, and Buchsbaum - Freudenstei. It is discussed that there are certain cases in which they are too ambiguous and incorrect to use. However, a matrix method is suggested based on the rank of the Jacobian of the mechanism and its applica...
متن کاملSOLVING FUZZY LINEAR SYSTEMS BY USING THE SCHUR COMPLEMENT WHEN COEFFICIENT MATRIX IS AN M-MATRIX
This paper analyzes a linear system of equations when the righthandside is a fuzzy vector and the coefficient matrix is a crisp M-matrix. Thefuzzy linear system (FLS) is converted to the equivalent crisp system withcoefficient matrix of dimension 2n × 2n. However, solving this crisp system isdifficult for large n because of dimensionality problems . It is shown that thisdifficulty may be avoide...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Algebra
سال: 2013
ISSN: 0092-7872,1532-4125
DOI: 10.1080/00927872.2011.630711